- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources2
- Resource Type
-
0000000002000000
- More
- Availability
-
20
- Author / Contributor
- Filter by Author / Creator
-
-
Agabekov, Vladimir E (1)
-
Alabugin, Igor V (1)
-
Christopher, Kimberley M (1)
-
Conlon, David (1)
-
Gatilov, Yuri V (1)
-
Goltsova, Victoria V (1)
-
Ilyina, Irina V (1)
-
Lee, Joonkyung (1)
-
Patrusheva, Oksana S (1)
-
Salakhutdinov, Nariman F (1)
-
Sidorenko, Alexander (1)
-
Sidorenko, Alexander Yu (1)
-
Volcho, Konstantin P (1)
-
#Tyler Phillips, Kenneth E. (0)
-
#Willis, Ciara (0)
-
& Abreu-Ramos, E. D. (0)
-
& Abramson, C. I. (0)
-
& Abreu-Ramos, E. D. (0)
-
& Adams, S.G. (0)
-
& Ahmed, K. (0)
-
- Filter by Editor
-
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
(submitted - in Review for IEEE ICASSP-2024) (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Abstract Sidorenko’s conjecture states that, for all bipartite graphs $$H$$, quasirandom graphs contain asymptotically the minimum number of copies of $$H$$ taken over all graphs with the same order and edge density. While still open for graphs, the analogous statement is known to be false for hypergraphs. We show that there is some advantage in this, in that if Sidorenko’s conjecture does not hold for a particular $$r$$-partite $$r$$-uniform hypergraph $$H$$, then it is possible to improve the standard lower bound, coming from the probabilistic deletion method, for its extremal number $$\textrm{ex}(n,H)$$, the maximum number of edges in an $$n$$-vertex $$H$$-free $$r$$-uniform hypergraph. With this application in mind, we find a range of new counterexamples to the conjecture for hypergraphs, including all linear hypergraphs containing a loose triangle and all $$3$$-partite $$3$$-uniform tight cycles.more » « less
-
Ilyina, Irina V; Patrusheva, Oksana S; Goltsova, Victoria V; Christopher, Kimberley M; Gatilov, Yuri V; Sidorenko, Alexander Yu; Agabekov, Vladimir E; Salakhutdinov, Nariman F; Alabugin, Igor V; Volcho, Konstantin P (, The Journal of Organic Chemistry)Chiral oxygen-containing heterocyclic compounds are of great interest for the development of pharmaceuticals. Monoterpenes and their derivatives are naturally abundant precursors of novel synthetic chiral oxygen-containing heterocyclic compounds. In this study, acid catalyzed reactions of salicylic aldehydes with (−)-8-acetoxy-6-hydroxymethyllimonene, readily accessible from α-pinene, leads to the formation of chiral polycyclic products of various structural types. Three of the six isolated chiral heterocyclic products obtained from salicylic aldehyde contain previously unknown polycyclic ring types. Having carried out the reaction in the presence of Brønsted or Lewis acids (Amberlyst 15, trifluoromethanesulfonic acid, trifluoroacetic acid and boron trifluoride etherate) or aluminosilicates (montmorillonite K10, halloysite nanotubes), we found that the nature of products depends on the catalyst as well as the reaction conditions (reaction time, reactant ratio, presence or absence of solvent). Detailed mechanistic insight on the complex cascade reactions for product formation is provided with extensive experimental and quantum mechanical computational studies.more » « less
An official website of the United States government
